Factorization of RSA-180
نویسندگان
چکیده
We present a brief report on the factorization of RSA-180, currently smallest unfactored RSA number. We show that the numbers of similar size could be factored in a reasonable time at home using open source factoring software running on a few Intel Core i7 PCs.
منابع مشابه
A New Factorization Method to Factorize RSA Public Key Encryption
The security of public key encryption such as RSA scheme relied on the integer factoring problem. The security of RSA algorithm is based on positive integer N, because each transmitting node generates pair of keys such as public and private. Encryption and decryption of any message depends on N. Where, N is the product of two prime numbers and pair of key generation is dependent on these prime ...
متن کاملPublic Key Cryptography
2 RSA 4 2.1 The RSA system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Establishing secret communication using the RSA system . . . . . . . . . . . . . 4 2.3 Security of RSA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 A very small example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.5 Factoring Record...
متن کاملFactorization of a 768-Bit RSA Modulus
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
متن کاملRevisiting Fermat's Factorization for the RSA Modulus
We revisit Fermat’s factorization method for a positive integer n that is a product of two primes p and q. Such an integer is used as the modulus for both encryption and decryption operations of an RSA cryptosystem. The security of RSA relies on the hardness of factoring this modulus. As a consequence of our analysis, two variants of Fermat’s approach emerge. We also present a comparison betwee...
متن کاملFactorization of a 1061-bit number by the Special Number Field Sieve
I provide the details of the factorization of the Mersenne number 21061 − 1 by the Special Number Field Sieve. Although this factorization is easier than the completed factorization of RSA-768, it represents a new milestone for factorization using publicly available software.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010